Path graph

Results: 1083



#Item
651Know thy Neighbor’s Neighbor: the Power of Lookahead in Small Worlds and Randomized P2P Networks∗† Gurmeet Singh Manku‡ Moni Naor§¶

Know thy Neighbor’s Neighbor: the Power of Lookahead in Small Worlds and Randomized P2P Networks∗† Gurmeet Singh Manku‡ Moni Naor§¶

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-11-19 02:38:54
652Point-to-Point Shortest Path Algorithms with Preprocessing Andrew V. Goldberg Microsoft Research – Silicon Valley 1065 La Avenida, Mountain View, CA 94062, USA [removed] URL: http://www.research.microsoft.

Point-to-Point Shortest Path Algorithms with Preprocessing Andrew V. Goldberg Microsoft Research – Silicon Valley 1065 La Avenida, Mountain View, CA 94062, USA [removed] URL: http://www.research.microsoft.

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2007-05-08 19:26:12
653Journal of Arti cial Intelligence Research[removed]318  Submitted 04/04
 published[removed]Additive Pattern Database Heuristics Ariel Felner

Journal of Arti cial Intelligence Research[removed]318 Submitted 04/04 published[removed]Additive Pattern Database Heuristics Ariel Felner

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2009-08-06 19:19:52
654Model Checking by Random Walk P@trik Haslum Department of Computer Science, Linkoping University [removed]

Model Checking by Random Walk P@trik Haslum Department of Computer Science, Linkoping University [removed]

Add to Reading List

Source URL: www.ida.liu.se

Language: English - Date: 2012-02-01 04:30:03
655J Glob Optim DOI[removed]s10898[removed]Optimal placement of UV-based communications relay nodes Oleg Burdakov · Patrick Doherty · Kaj Holmberg ·

J Glob Optim DOI[removed]s10898[removed]Optimal placement of UV-based communications relay nodes Oleg Burdakov · Patrick Doherty · Kaj Holmberg ·

Add to Reading List

Source URL: www.ida.liu.se

Language: English - Date: 2012-01-20 06:09:28
656Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP Marcus Bjareland? Peter Jonsson?? Dept. of Comp. and Info. Sci. Linkopings universitet

Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP Marcus Bjareland? Peter Jonsson?? Dept. of Comp. and Info. Sci. Linkopings universitet

Add to Reading List

Source URL: www.ida.liu.se

Language: English - Date: 2012-01-24 05:34:39
657On the Complexity of Finding Spanner Paths

On the Complexity of Finding Spanner Paths

Add to Reading List

Source URL: www.ida.liu.se

Language: English - Date: 2013-06-03 08:35:50
658A Faster Algorithm for Betweenness Centrality∗ Ulrik Brandes University of Konstanz Department of Computer & Information Science Box D 67, 78457 Konstanz, Germany [removed]

A Faster Algorithm for Betweenness Centrality∗ Ulrik Brandes University of Konstanz Department of Computer & Information Science Box D 67, 78457 Konstanz, Germany [removed]

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-11-19 02:38:20
659Linköping Studies in Science and Technology Thesis No[removed]Computer-Assisted Troubleshooting for Efficient Off-board Diagnosis Håkan Warnquist

Linköping Studies in Science and Technology Thesis No[removed]Computer-Assisted Troubleshooting for Efficient Off-board Diagnosis Håkan Warnquist

Add to Reading List

Source URL: www.ida.liu.se

Language: English - Date: 2012-01-24 05:41:39
660Towards Knowledge-Enriched Path Computation Georgios Skoumas♦ Klaus Arthur Schmid♠ Gregor Jossé♠ Andreas Züfle♠ Mario A. Nascimento♥ Matthias Renz♠ Dieter Pfoser♣ ♦  National Technical University of Ath

Towards Knowledge-Enriched Path Computation Georgios Skoumas♦ Klaus Arthur Schmid♠ Gregor Jossé♠ Andreas Züfle♠ Mario A. Nascimento♥ Matthias Renz♠ Dieter Pfoser♣ ♦ National Technical University of Ath

Add to Reading List

Source URL: www.dbs.ifi.lmu.de

Language: English - Date: 2014-09-25 06:36:31